C6-free bipartite graphs and product representation of squares
نویسندگان
چکیده
منابع مشابه
Making a C6-free graph C4-free and bipartite
Let e(G) denote the number of edges in a graph G, and let Ck denote a k-cycle. It is well-known that every graph has a bipartite subgraph with at least half as many edges. Győri showed that any bipartite, C6-free graph contains a C4-free subgraph containing at least half as many edges. Applying these two results in sequence we see that every C6-free graph, G, has a bipartite C4-free subgraph, H...
متن کاملBipartite density of triangle-free subcubic graphs
A graph is subcubic if its maximum degree is at most 3. The bipartite density of a graph G is defined as b(G) = max{|E(B)|/|E(G)| : B is a bipartite subgraph of G}. It was conjectured by Bondy and Locke that if G is a triangle-free subcubic graph, then b(G) ≥ 45 and equality holds only if G is in a list of seven small graphs. The conjecture has been confirmed recently by Xu and Yu. This note gi...
متن کاملBipartite subgraphs of triangle-free subcubic graphs
Suppose G is a graph with n vertices and m edges. Let n′ be the maximum number of vertices in an induced bipartite subgraph of G and let m′ be the maximum number of edges in a spanning bipartite subgraph of G. Then b(G) = m′/m is called the bipartite density of G, and b∗(G) = n′/n is called the bipartite ratio of G. This paper proves that every 2connected triangle-free subcubic graph, apart fro...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملWeak Modular Product of Bipartite Graphs, Bicliques and Isomorphism
A 1978 theorem of Kozen states that two graphs on n vertices are isomorphic if and only if there is a clique of size n in the weak modular product between the two graphs. Restricting to bipartite graphs and considering complete bipartite subgraphs (bicliques) therein, we study the combinatorics of the weak modular product. We identify cases where isomorphism is tractable using this approach, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00184-7